A Hierarchical Multicast Routing Using Inter-Cluster Group Mesh Structure for Mobile Ad Hoc Networks

نویسندگان

  • Izumi Yamamoto
  • Kazuki Ogasawara
  • Tomoyuki Ohta
  • Yoshiaki Kakuda
چکیده

Multicast communication over mobile ad hoc networks has become popular. However, dependable and scalable multicast routing is required for mobile ad hoc networks even though network size and node mobility continue to increase. Therefore, this paper proposes a new hierarchical multicast routing scheme for such ad hoc networks. The proposed scheme introduces the inter-cluster group mesh structure based on our previous autonomous clustering proposal. In the proposed scheme, data packets are delivered from the source node to the multicast members through multiple routes over the inter-cluster group mesh structure. Simulations show that the proposed scheme is scalable with regard to network size and strong against node mobility; it can provide dependable multicast communication on large mobile ad hoc networks. key words: ad hoc networks, multicast routing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple-Landmark Routing for Large Groups in Ad Hoc Networks

A typical scenario in Mobile Ad Hoc Networks (MANET) consists of nodes having functional and motorial affinities (e.g., tanks in the same battalion). In order to achieve scalability for such a network having a large scale, we introduce, in this paper, a novel ”Multiple-Landmark” Ad Hoc Routing protocol (M-LANMAR). The protocol is an ”implicit”, flexible hierarchical routing scheme following the...

متن کامل

Adaptive Power-Aware Clustering and Multicasting Protocol for Mobile Ad Hoc Networks

One of the most critical issues in wireless ad hoc networks is represented by the limited availability of energy within network nodes. Most of the researches focused on the problem of routing issues rather than energy efficiency or prolongation of network lifetime. In this paper, we proposed a multicast power greedy clustering algorithm (termed as MPGC) with the mesh scheme in the multicasting ...

متن کامل

Dynamic agent-based hierarchical multicast for wireless mesh networks

We propose and analyze a multicast algorithm named Dynamic Agent-based Hierarchical Multicast (DAHM) for wireless mesh networks that supports user mobility and dynamic group membership. The objective of DAHM is to minimize the overall network cost incurred. DAHM dynamically selects multicast routers serving as multicast agents for integrated mobility and multicast service management, effectivel...

متن کامل

A Reliable Multicast Algorithm for Mobile Ad Hoc Networks

A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path between a pair of nodes. The algorithm has the characteristics of using an undirected graph for its routing operations rather than a fixed structure like a tree or a mesh. Previously proposed routing metrics for mobile ...

متن کامل

A Survey on Multicast Routing Protocols for Mobile Ad Hoc Networks

There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categoriesmulticast routing based o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 92-B  شماره 

صفحات  -

تاریخ انتشار 2009